semi dsupervis dimens reduct multi dlabel classif flexibl constrain spectral cluster unifi depend cluster dispar cluster dhomogen data modern data mine set involv combin attributevalu descriptor entiti relationship entiti present approach cluster homogen dataset relationship impos depend cluster dispar cluster constraint unlik prior work view constraint boolean criteria present formul constraint satisfi violat smooth manner enabl achiev depend cluster dispar cluster optim framework maxim versu minim object function present result synthet data real world dataset sat dbase framework effici constrain cluster discov context contextu outlier random walk graph principl flexibl framework find altern cluster knowledg driven dimens reduct cluster algorithm appli complex domain involv high dimension data set salient repres data dimens reduct approach driven object function partial suit end user requir work show incorpor gener purpos domain expertis encod graph dimens reduct lend eleg gener eigenvalu problem call approach graph driven constrain dimens reduct linear project gcdr lp show desir properti principl flexibl framework find altern cluster cluster constraint paper studi problem build cluster music track collect popular music presenc constraint constraint natur context music applic constraint gener background knowledg artist share similar style user access pattern piec music share similar access pattern multipl user present approach base gener constraint cluster algorithm incorpor constraint group music similar artist approach evalu data set consist album cover popular artist correct cluster gener test artist similar provid music guid data prepar data qualiti matric classif mine find altern cluster constraint intract cluster constraint effici increment constrain cluster cluster constraint emerg area data mine research work assum constraint larg batch paper explor situat constraint increment user cluster provid posit neg feedback constraint critiqu cluster solut problem effici updat cluster satisfi constraint cluster entir data set show problem increment cluster constraint np hard gener identifi suffici condit lead effici solvabl version translat set rule type constraint ad constraint set properti maintain demonstr approach effici cluster entir data set advantag constraint ddriven cluster cluster method data driven driven data driven method intend discov true structur underli data driven method aim organ true structur meet applic requir driven constrain cluster find action cluster applic energi awar sensor network privaci preserv market segment exist method constrain cluster requir user provid number cluster unknown advanc crucial impact cluster result paper argu natur gener action cluster applic specif constraint decid number cluster purpos introduc cluster model constraint driven cluster cdc find priori unspecifi number compact cluster satisfi user provid constraint gener type constraint consid minimum signific constraint minimum varianc constraint combin type prove np hard cdc problem constraint propos dynam data structur cd tree organ data point leaf node leaf node approxim satisfi cdc constraint minim object function base cd tree develop effici algorithm solv cluster problem experiment evalu synthet real dataset demonstr qualiti gener cluster scalabl algorithm sampl select bia effici correct model averag unlabel exampl complex dhierarch cluster instanc cluster level constraint editori special issu mine low dqualiti data identifi gener easi set constraint cluster constrain cluster benefici research illustr constraint improv result varieti cluster algorithm larg variat improv fix number constraint data set present attempt provid insight phenomenon character constraint set properti inconsist incoher show measur strongli anti correl cluster algorithm perform comput prior cluster measur aid decid constraint practic forecast skew bias stochast ozon dai analys solut revers test effici framework select classifi sampl select bia import assumpt made classif algorithm train test set drawn distribut call stationari distribut assumpt futur past data set ident probabilist standpoint domain real world applic market solicit fraud detect drug test loan approv popul survei school enrol rare case label sampl train bias wai due varieti practic reason limit circumst tradit method evalu expect gener error classif algorithm structur risk minim ten fold cross valid leav valid return poor estim classif algorithm train bias dataset accur futur unbias dataset number compet candid estim order learn algorithm accuraci poor random guess method determin accur learner need data mine sampl select bia real world applic present approach determin learner perform unbias test set possibl bias train set fraction comput cost cross valid base approach measur constraint dset util partit cluster algorithm abstract cluster constraint activ area machin learn data mine research previou empir work convincingli shown ad constraint cluster improv perform varieti algorithm experi result averag randomli chosen constraint set set label mask interest properti individu set demonstr constraint set vari significantli constrain cluster constraint set decreas algorithm perform creat quantit measur inform coher identifi constraint set show measur explain differ perform constrain cluster algorithm effici model averag dperform boost bag abstract bayesian model averag bay optim classifi boc ensembl techniqu extens statist literatur compar ensembl techniqu bag boost boc rare data mine partli due model averag perceiv ineffici bag boost consist outperform singl model rais question boc datamin show answer question illustr recent effici model averag approach significantli outperform bag boost realist difficult situat extens class label nois sampl select bia class problem knowledg insight model averag outperform bag boost situat publish machin learn mine statist commun activ learn partial label data bia reduct improv categor classifi sensit sampl select bia recent paper categor classifi learn algorithm sensit common type sampl select bia chanc select train sampl depend featur vector directli class label classifi learner categor local insensit type sampl select bia consid global paper true model distinguish model algorithm output discuss bayesian classifi logist regress hard margin support vector machin true model model gener true class label implicitli assum contain model space learner true class probabl model estim class probabl assum asymptot converg train data set size increas discuss naiv bay decis tree soft margin support vector machin model space assum true model classif algorithm argu global learner argu classifi learn algorithm includ discuss affect sampl select bia depend dataset heurist induct bia impli classifi learn algorithm appropri dataset make earlier experiment result produc addit result illustr claim dynam adapt sampl algorithm dasa real world applic finger print recognit face recognit agglom hierarch cluster constraint theoret empir result abstract explor instanc cluster level constraint agglom hierarch cluster previou work illustr benefit constraint hierarch cluster applic hierarch cluster straight forward primari reason constraint combin make feasibl problem exist singl feasibl solut np complet constraint combin tradit agglom algorithm dendrogram stop prematur dead end solut exist feasibl solut significantli smaller number cluster constraint lead effici solvabl feasibl problem standard agglom algorithm give rise dead end solut empir illustr benefit constraint improv cluster puriti averag distort introduc constraint conjunct triangl inequ consider improv effici agglom cluster cluster constraint feasibl issu dmean algorithm recent work look extend mean algorithm incorpor background inform form instanc level link link constraint introduc wai addit background inform form constraint oper instanc interpret conjunct disjunct instanc level constraint easi implement present complex result feasibl cluster type constraint individu type kei find determin feasibl solut satisfi constraint gener np complet iter algorithm mean find feasibl partit iter motiv deriv version mean algorithm minim constrain vector quantiz error iter attempt satisfi constraint standard uci dataset find constraint improv accuraci report show algorithm reduc number iter converg final illustr benefit constraint type complex real world object identif problem infra red detector aibo robot ensembl techniqu stabl learner perform bound ensembl techniqu bag decor exploit instabl learner decis tree creat divers set model applic stabl learner nave bay yield improv degrad perform claim empir verifi paper stabl learner desir superior perform problem algorithm simplic show learner commonli refer stabl gaussian posterior distribut defin posterior distribut parametr nonparametr bootstrap creat process approxim take draw posterior sum joint distribut instanc class approxim posterior model averag optim bay classifi obc minim bay error refer approach bootstrap model averag model averag remov model uncertainti work model uncertainti harm claim empir verifi gaussian distribut mathemat understood bound increas obc error chebychev bound function number model built empir illustr approach us verifi bound correct bayesian model averag model space compact encod bayesian model averag bma improv predict accuraci averag infer model model space markov chain mont carlo mcmc sampl standard implement bma encount difficulti simpl model space introduc minimum messag length mml coupl mcmc methodolog address difficulti addit benefit illustr methodolog mixtur compon model cluster show approach produc interpret result compar green popular revers jump sampl model space techniqu mml principl mathemat embodi occam razor assign penal prior probabl complic model find bma predict base sampl multipl space complex make improv predict compar singl shortest model central limit theorem belief network learn learn paramet condit margin probabl data set common method build belief network situat complet miss valu size data set randomli select popul data set learn network paramet data set situat uncertainti posterior distribut paramet graph paramet learnt differ data set data set paper show paramet estim data set converg gaussian distribut equal popul true paramet result obtain straightforward applic central limit theorem belief network empir verifi central tendenc learnt paramet show paramet varianc accur estim efron bootstrap sampl approach learn multipl network bootstrap sampl calcul paramet expect standard belief network moment varianc expect varianc paramet potenti applic paper discuss initi attempt explor obtain confid interv belief network infer chebychev bound determin worth gather data learn inform theoret optim classifi semi dsupervis learn locat secret messag imag steganographi involv hide messag innocu media imag steganalysi field detect secret messag ultim goal steganalysi fold make binari classif file stego bear innoc locat hidden messag aim extract steril manipul steganalysi approach attack focu issu paper explor difficult relat problem imag file steganographi locat pixel messag treat hidden messag locat problem outlier detect probabl energi measur imag motiv imag restor commun pixel contribut energi calcul imag deem outlier typic top percent energ pixel outlier find stego bear color imag grayscal imag imag type pixel stego bear indic techniqu substanti lift random guess gener approach incorpor data qualiti matric data mine algorithm st author affili st line address line address telephon number incl countri code st author email address applic particl visual framework search hidden messag automat detect steganographi visual cluster result hierarch cluster long histori numer taxonomi machin learn applic field data mine statist analysi inform retriev cluster involv find specif number subgroup set observ data point object minimum messag length cluster gibb sampl mean em algorithm popular cluster mixtur model due simplic eas implement signific limit converg local optimum respect object function ignor uncertainti model space requir apriori specif number class cluster inconsist work overcom limit minimum messag length mml principl variat kmean em observ assign paramet calcul scheme maintain simplic approach construct bayesian mixtur model tool sampl search model space markov chain mont carlo mcmc sampler gibb sampler background contextu knowledg document represent describ approach document represent captur contextu depend term corpu make depend repres document represent scheme automat document categoris reuter test set document achiev precis recal break point compar publish result approach act featur select techniqu altern appli techniqu machin learn numer taxonomi test conform osi standard 